An Optimal Competitive Strategy for Walking in Streets

نویسندگان

  • Christian Icking
  • Rolf Klein
  • Elmar Langetepe
چکیده

We present an optimal strategy for searching for a goal in a street which achieves the competitive factor of √ 2, thus matching the best lower bound known before. This finally settles an interesting open problem in the area of competitive path planning many authors have been working on.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Competitive Strategy for Walking in Generalized Streets for a Simple Robot

In this study, we consider the problem of walking in an unknown generalized street or G-street, for a simple robot. The basic robot is equipped with a sensor that only detect the discontinuities in depth information (gaps). In the former recent researches some competitive strategies for walking the robot in street polygons have been presented. In this research we have empowered the robot by add...

متن کامل

Randomized Strategy for Walking in Streets for a Simple Robot

We consider the problem of walking in an unknown street, for a robot that has a minimal sensing capability. The robot is equipped with a sensor that only detects the discontinuities in depth information (gaps) and can locate the target point as enters in its visibility region. First, we propose an online deterministic search strategy that generates an optimal search path for the simple robot to...

متن کامل

A Comprehensive Survey on GenCos’ Optimal Bidding Strategy Problem in Competitive Power Markets

This paper represents a complete survey on Generation Companies’ (GenCos’) optimal bidding strategy problem in restructured power markets. In this regard after an introduction to competitive electricity markets, concept of optimal bidding strategy is presented. Considering large amount of works accomplished in this area a novel classification is implemented in order to categorize the existing d...

متن کامل

An Optimal Strategy for Searching in Unknown Streets

We consider the problem of a robot searching for an unknown , yet visually recognizable target in a street. A street is a simple polygon with start and target on the boundary so that the two boundary chains between them are weakly mutually visible. We are interested in the ratio of the search path length to the shortest path length which is called the competitive ratio of the strategy. We prese...

متن کامل

Optimal emergency demand response program integrated with multi-objective dynamic economic emission dispatch problem

Nowadays, demand response programs (DRPs) play an important role in price reduction and reliability improvement. In this paper, an optimal integrated model for the emergency demand response program (EDRP) and dynamic economic emission dispatch (DEED) problem has been developed. Customer’s behavior is modeled based on the price elasticity matrix (PEM) by which the level of DRP is determined for ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999